Grokking Tree Coding Patterns for Interviews
Rate this course
Ask Author
Contribute
Back to course home

0% completed

Vote For New Content
Course Overview
Introduction to Tree
Types of Tree
BST Traversal Techniques
BST Operations
Introduction to Level Order Traversal Pattern
Reverse Level Order Traversal (easy)
Solution: Reverse Level Order Traversal
Find Largest Value in Each Tree Row (medium)
Solution: Find Largest Value in Each Tree Row
Maximum Width of Binary Tree (medium)
Solution: Maximum Width of Binary Tree
Maximum Level Sum of a Binary Tree (medium)
Solution: Maximum Level Sum of a Binary Tree
Zigzag Traversal (medium)
Solution: Zigzag Traversal
Even Odd Tree (medium)
Solution: Even Odd Tree
N-ary Tree Level Order Traversal (hard)
Solution: N-ary Tree Level Order Traversal
Introduction to Tree Depth Pattern
Maximum Depth (or Height) of Binary Tree (easy)
Solution: Maximum Depth (or Height) of Binary Tree
Minimum Depth of a Binary Tree (easy)
Solution: Minimum Depth of a Binary Tree
Balanced Binary Tree (easy)
Solution: Balanced Binary Tree
Tree Diameter (easy)
Solution: Tree Diameter
Maximum Depth of N-ary Tree (easy)
Solution: Maximum Depth of N-ary Tree
Find maximum depth of subtree (medium)
Solution: Find maximum depth of subtree
Root to Leaf Path Pattern (medium)
Introduction to Root to Leaf Path Pattern
Binary Tree Paths (easy)
Solution: Binary Tree Paths
Sum of Root To Leaf Binary Numbers (easy)
Solution: Sum of Root To Leaf Binary Numbers
Insufficient Nodes in Root to Leaf Paths (medium)
Solution: Insufficient Nodes in Root to Leaf Paths
Smallest String Starting From Leaf (medium)
Solution: Smallest String Starting From Leaf
Pseudo-Palindromic Paths in a Binary Tree (medium)
Solution: Pseudo-Palindromic Paths in a Binary Tree
All Paths for a Sum (medium)
Solution: All Paths for a Sum
Sum of Path Numbers (medium)
Solution: Sum of Path Numbers
Path With Given Sequence (medium)
Solution: Path With Given Sequence
Count Paths for a Sum (medium)
Solution: Count Paths for a Sum
Leaf Processing Pattern (medium)
Introduction to Leaf Processing Pattern
Sum of Left Leaves (easy)
Solution: Sum of Left Leaves
Leaf-Similar Trees (easy)
Solution: Leaf-Similar Trees
Check if all leaves are at same level (medium)
Solution: Check if all leaves are at same level
Delete Leaves With a Given Value (medium)
Solution: Delete Leaves With a Given Value
Deepest Leaves Sum (medium)
Solution: Deepest Leaves Sum
Tree View Pattern (medium)
Introduction to Tree View Pattern
Right View of a Binary Tree (medium)
Solution: Right View of a Binary Tree
Top View Of the Binary Tree (medium)
Solution: Top View Of the Binary Tree
Bottom View Of the Binary Tree (medium)
Solution: Bottom View Of the Binary Tree
Boundary of Binary Tree (medium)
Solution: Boundary of Binary Tree
Comparison of Two Trees Pattern (medium)
Introduction to Comparison of Two Trees Pattern
Symmetric Tree (easy)
Solution: Symmetric Tree
Mirror Image Trees (medium)
Solution: Mirror Image Trees
Subtree of Another Tree (easy)
Solution: Subtree of Another Tree
Isomorphic Trees (medium)
Solution: Isomorphic Trees
Serialize and Deserialize Tree Pattern (hard)
Introduction to Serialize and Deserialize Tree Pattern
Serialize and Deserialize BST (medium)
Solution: Serialize and Deserialize BST
Verify Preorder Serialization of a Binary Tree (medium)
Solution: Verify Preorder Serialization of a Binary Tree
Create Binary Tree From Descriptions (medium)
Solution: Create Binary Tree From Descriptions
Serialize and Deserialize N-ary Tree (hard)
Solution: Serialize and Deserialize N-ary Tree
Solution: Create Binary Tree From Descriptions

Problem Statement

You are given a 2D list called descriptions. Each element in descriptions represents a relationship in a binary tree. The element descriptions[i] = [parenti, childi, isLefti] tells us that parenti is the paent of childi. The isLefti value can be either 1 or 0:

  • If isLefti is 1, childi is the left child of parenti.
  • If isLefti is 0, childi is the right child of parenti.

Build this binary tree from the given description and return its root node.

Each node in the binary tree has a unique value.

Examples

Example 1

  • Input: descriptions = [[1, 2, 1], [1, 3, 0], [2, 4, 1]]
  • Expected Output: [1, 2, 3, 4]
Image
  • Justification: Node 1 is the root, 2 is the left child, 3 is the right child. Node 2 has 4 as its left child.

Example 2:

  • Input: descriptions = [[10, 5, 1], [10, 15, 0], [5, 3, 1], [15, 20, 0]]
  • Expected Output: [10,5,15,3,null,null,20]
Image
  • Justification: Node 10 is the root, with 5 as the left child and 15 as the right child. Node 5 has 3 as its left child, and 15 has 20 as its right child.

Example 3:

  • Input: descriptions = [[5, 3, 1], [5, 7, 0], [3, 2, 1], [3, 4, 0]]
  • Expected Output: [5,3,7,2,4]
Image
  • Justification: Node 5 is the root with 3 as the left child and 7 as the right child. Node 3 has 2 as the left child and 4 as the right child.

Constraints:

  • 1 <= descriptions.length <= 104
  • descriptions[i].length == 3
  • 1 <= parenti, childi <= 105
  • 0 <= isLefti <= 1
  • The binary tree described by descriptions is valid.

Solution

To solve this problem, we create a map to store nodes by their values. Each time we encounter a parent or child value, we ensure that a corresponding node exists in this map (by checking if the node already exists and creating it if it doesn't). We also maintain a set of child nodes to track which nodes are children in the tree. After processing the entire input, the root node will be the only node not found in this set of children (because every other node is a child of some other node). We then return this root node to represent the complete binary tree. This approach is effective because it handles all necessary tasks (node creation, tree construction, and root detection) in a single pass through the input, making it efficient.

Step-by-Step Algorithm

  1. Initialize Structures:
    • Create a map (nodeMap) to store nodes using their values as keys.
    • Create a set (children) to keep track of child nodes.
  2. Iterate through descriptions:
    • For each description:
      • Extract the values of parent, child, and isLeft.
      • Create or fetch parent node:
        • Check if parent exists in nodeMap. If not, create a new TreeNode for parent and put it in nodeMap.
      • Create or fetch child node:
        • Check if child exists in nodeMap. If not, create a new TreeNode for child and put it in nodeMap.
      • Add the child to the parent:
        • If isLeft == 1, set parent.left to the child.
        • If isLeft == 0, set parent.right to the child.
      • Record the child node:
        • Add the child value to the children set.
  3. Determine the root:
    • Iterate through the keys (node values) in nodeMap. The node whose value is not in the children set is the root, since it is not a child of any other node.
  4. Return the root node:
    • Return the node found in the previous step as the root of the binary tree.

Algorithm Walkthrough

We will now walk through the algorithm using the input:

descriptions = [[10, 5, 1], [10, 15, 0], [5, 3, 1], [15, 20, 0]]
  1. Initialize nodeMap and children:

    • nodeMap = {} (empty map)
    • children = {} (empty set)
  2. Processing each description:

    • First description [10, 5, 1]:
      • Parent is 10, child is 5, and isLeft == 1.
      • 10 is not in nodeMap, so we create a node for 10: TreeNode(10).
      • 5 is not in nodeMap, so we create a node for 5: TreeNode(5).
      • Set 10.left = 5.
      • Add 5 to children: children = {5}.
    • Second description [10, 15, 0]:
      • Parent is 10, child is 15, and isLeft == 0.
      • 10 is already in nodeMap, so no need to create a new node.
      • 15 is not in nodeMap, so we create a node for 15: TreeNode(15).
      • Set 10.right = 15.
      • Add 15 to children: children = {5, 15}.
    • Third description [5, 3, 1]:
      • Parent is 5, child is 3, and isLeft == 1.
      • 5 is already in nodeMap.
      • 3 is not in nodeMap, so we create a node for 3: TreeNode(3).
      • Set 5.left = 3.
      • Add 3 to children: children = {3, 5, 15}.
    • Fourth description [15, 20, 0]:
      • Parent is 15, child is 20, and isLeft == 0.
      • 15 is already in nodeMap.
      • 20 is not in nodeMap, so we create a node for 20: TreeNode(20).
      • Set 15.right = 20.
      • Add 20 to children: children = {3, 5, 15, 20}.
  3. Find the root:

    • We check the keys in nodeMap: 10, 5, 15, 3, 20.
    • The value 10 is not in children, so 10 is the root.
  4. Return the root:

    • The root node is TreeNode(10).

Code

Java
Saved to Cloud

. . . .

Complexity Analysis

Time Complexity

  • Tree Construction: For each description, we either create or retrieve the parent and child nodes from a hashmap, which is an operation. To traverse n descriptions, the overall time complexity is .

Therefore, the total time complexity of the solution is .

Space Complexity

  • Tree Construction: We store all nodes in a hashmap and a set. The space required for this is proportional to the number of nodes, .

Thus, the space complexity of the algorithm is .

Create Binary Tree From Descriptions (medium)
Serialize and Deserialize N-ary Tree (hard)
Mark as Completed

On this page

Problem Statement

Examples

Solution

Step-by-Step Algorithm

Algorithm Walkthrough

Code

Complexity Analysis

Time Complexity

Space Complexity